Breaking SIDH in Polynomial Time
نویسندگان
چکیده
We show that we can break SIDH in (classical) polynomial time, even with a random starting curve $$E_0$$ .
منابع مشابه
Symmetry Breaking with Polynomial Delay
A conservative class of constraint satisfaction problems (csps) is a class for which membership is preserved under arbitrary domain reductions. Many well-known tractable classes of csps are conservative. It is well known that lexleader constraints may significantly reduce the number of solutions by excluding symmetric solutions of csps. We show that adding certain lexleader constraints to any i...
متن کاملBreaking the $1/\sqrt{n}$ Barrier: Faster Rates for Permutation-based Models in Polynomial Time
Many applications, including rank aggregation and crowd-labeling, can be modeled in terms of a bivariate isotonic matrix with unknown permutations acting on its rows and columns. We consider the problem of estimating such a matrix based on noisy observations of a subset of its entries, and design and analyze polynomial-time algorithms that improve upon the state of the art. In particular, our r...
متن کاملBreaking the 1/√n Barrier: Faster Rates for Permutation-based Models in Polynomial Time
Many applications, including rank aggregation and crowd-labeling, can be modeled in terms of a bivariate isotonic matrix with unknown permutations acting on its rows and columns. We consider the problem of estimating such a matrix based on noisy observations of a subset of its entries, and design and analyze a polynomial-time algorithm that improves upon the state of the art. In particular, our...
متن کاملEfficient Compression of SIDH Public Keys
Supersingular isogeny Diffie-Hellman (SIDH) is an attractive candidate for postquantum key exchange, in large part due to its relatively small public key sizes. A recent paper by Azarderakhsh, Jao, Kalach, Koziel and Leonardi showed that the public keys defined in Jao and De Feo’s original SIDH scheme can be further compressed by around a factor of two, but reported that the performance penalty...
متن کاملFully Dynamic Almost-Maximal Matching: Breaking the Polynomial Barrier for Worst-Case Time Bounds
Despite significant research effort, the state-of-the-art algorithm for maintaining an approximate matching in fully dynamic graphs has a polynomial worst-case update time, even for very poor approximation guarantees. In a recent breakthrough, Bhattacharya, Henzinger and Nanongkai showed how to maintain a constant approximation to the minimum vertex cover, and thus also a constant-factor estima...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2023
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-031-30589-4_17